Edge Projection and the Maximum
نویسندگان
چکیده
Edge projection is a specialization of Lovv asz and Plummer's clique projection when restricted to edges. We discuss some properties of the edge projection which are then exploited to develop a new upper bound procedure for the Maximum Cardinality Stable Set Problem (MSS Problem). The upper bound computed by our heuristic, incorporated in a branch-and-bound scheme in conjunction with Balas and Yu branching rule, seems to be very eeective for sparse graphs, which are typically hard instances of the MSS Problem.
منابع مشابه
A flood risk projection for Soleimantangeh Dam against future climate change
A sensitivity analysis of the flood safety of Solaimantangeh dam using a regional climate change simulation is presented. Based on the output of the CCSM (Community Climate Change System Model) general circulation model, the NIRCM (North of Iran Regional Climate Model) computes regional scale output with 50 km spatial resolution and 21 vertical layers. Using the SRES (Special Report Emission Sc...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملA Branch and Cut solver for the maximum stable set problem
This paper deals with the cutting-plane approach to the maximum stable set problem. We provide theoretical results regarding the facet-defining property of inequalities obtained by a known project-and-lift-style separation method called edge-projection, and its variants. An implementation of a Branch and Cut algorithm is described, which uses edge-projection and two other separation tools which...
متن کاملA novel Local feature descriptor using the Mercator projection for 3D object recognition
Point cloud processing is a rapidly growing research area of computer vision. Introducing of cheap range sensors has made a great interest in the point cloud processing and 3D object recognition. 3D object recognition methods can be divided into two categories: global and local feature-based methods. Global features describe the entire model shape whereas local features encode the neighborhood ...
متن کامل